A quadratically convergent method for linear programming
نویسندگان
چکیده
منابع مشابه
A quadratically convergent VBSCF method.
A quadratically convergent valence bond self-consistent field method is described where the simultaneous optimisation of orbitals and the coefficients of the configurations (VB structures) is based on a Newton-Raphson scheme. The applicability of the method is demonstrated in actual calculations. The convergence and efficiency are compared with the Super-CI method. A necessary condition to achi...
متن کاملA Simple, Quadratically Convergent Interior Point Algorithm for Linear Programming and Convex Quadratic Programming
An algorithm for linear programming (LP) and convex quadratic programming (CQP) is proposed, based on an interior point iteration introduced more than ten years ago by J. Herskovits for the solution of nonlinear programming problems. Herskovits' iteration can be simpliied signiicantly in the LP/CQP case, and quadratic convergence from any initial point can be achieved. Interestingly the linear ...
متن کاملA Quadratically Convergent Interior-Point Algorithm for the P*(κ)-Matrix Horizontal Linear Complementarity Problem
In this paper, we present a new path-following interior-point algorithm for -horizontal linear complementarity problems (HLCPs). The algorithm uses only full-Newton steps which has the advantage that no line searchs are needed. Moreover, we obtain the currently best known iteration bound for the algorithm with small-update method, namely, , which is as good as the linear analogue.
متن کاملA quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points
A predictor-corrector method for solving linear programs from infeasible starting points is analyzed. The method is quadratically convergent and can be combined with Ye's finite termination scheme under very general assumptions. If the starting points are large enough then the algorithm has O(nL) iteration complexity. If the ratio between feasibility and optimality at the starting points is sma...
متن کاملA Quadratically Convergent Iterative Method for Nonlinear Equations
In this paper we propose a simple iterative method for finding a root of a nonlinear equation. It is shown that the new method, which does not require any derivatives, has a quadratic convergence order. In addition, one can find that a hybrid method combined with the noniterative method can further improve the convergence rate. To show the efficiency of the presented method we give some numeric...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1991
ISSN: 0024-3795
DOI: 10.1016/0024-3795(91)90278-5